|
|
|
| e-Pub |
Previous | 
Home
Section: Bilateral Contracts and Grants with Industry
Bilateral Contracts with Industry
Related to the evolutions and support of the Mumps solver (see Section 5.1 ), we worked on:
Research Program
Application Domains
New Software and Platforms
New Results
- Highlights of the Year
- Cost-Optimal Execution of Boolean DNF Trees with Shared Streams
- Efficient checkpoint/verification patterns for silent error detection
- Assessing general-purpose algorithms to cope with fail-stop and silent errors
- Scheduling the I/O of HPC applications under congestion
- Power-aware replica placement in tree networks with multiple servers per client
- Parallel scheduling of task trees with limited memory
- Scheduling Trees of Malleable Tasks for Sparse Linear Algebra
- Non-clairvoyant reduction algorithms for heterogeneous platforms
- Memory-aware tree traversals with pre-assigned tasks
- Analysis of Dynamic Scheduling Strategies for Matrix Multiplication on Heterogeneous Platforms
- Determining the optimal redistribution
- On the hierarchically structured bin packing problem
- Heuristics for the bipartite matching problem
- Fill-in reduction in sparse matrix factorizations using hypergraphs
- On partitioning two dimensional finite difference meshes for distributed memory parallel computers
- A symmetry preserving algorithm for matrix scaling
- Direct solvers for sparse linear systems
Bilateral Contracts and Grants with Industry
Partnerships and Cooperations
Bibliography